Existence of an infinite ternary 64-abelian square-free word
نویسندگان
چکیده
منابع مشابه
The minimal density of a letter in an infinite ternary square - free word is 0 . 2746
We study the minimal density of letters in infinite square-free words. First, we give some definitions of minimal density in infinite words and prove their equivalence. Further, we propose a method that allows to strongly reduce an exhaustive search for obtaining lower bounds for minimal density. Next, we develop a technique for constructing square-free morphisms with extremely small density fo...
متن کاملInfinite ternary square-free words concatenated from permutations of a single word
We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n ≥ 13. We show that there are uniform ternary morphisms of length k for every k ≥ 23. This resolves almost completely a problem of the author and Rampersad.
متن کاملDirect definition of a ternary infinite square-free sequence
We propose a new ternary infinite (even full-infinite) square-free sequence. The sequence is defined both by an iterative method and by a direct definition. Both definitions are analogous to those of the Thue-Morse sequence. The direct definition is given by a deterministic finite automaton with output. In short, the sequence is automatic.
متن کاملAbelian Square-Free Partial Words
Erdös raised the question whether there exist infinite abelian square-free words over a given alphabet (words in which no two adjacent subwords are permutations of each other). Infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words (sequences that may contain some h...
متن کاملn-Letter Ternary Square-Free Words
Recently, Ekhad and Zeilberger [4] presented an improved lower bound for the “connective constant” of ternary square-free words. Their bound of 2 is proven by constructing a “Brinkhuis triple-pair” of length 18. By presenting a Brinkhuis triple-pair of length 17, we show that, within the same particular class of Brinkhuis triples, the optimal bound is actually 2. A square-free word w is a word ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2014012